2 Definitions 2.1 Length (weight) of a Path 2.2 Distance between Two Vertices
نویسندگان
چکیده
2.2 Distance between Two Vertices The distance between two vertices u and v is defined as the length of the shortest path connecting them. Remark 1. The number of paths connecting two vertices could be exponential. As shown in the below illustration, there are around 3 ”blocks” to choose from given that there are n vertices in total and each block takes around 3 vertices. The number of paths available from s to t is therefore in O(2 n 3 ), which is exponential. Thus, it is unwise to find the shortest path by finding all possible paths and comparing their lengths.
منابع مشابه
The Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملQuasi-quadrics and related structures
In a projective space PG(n, q) a quasi-quadric is a set of points that has the same intersection numbers with respect to hyperplanes as a nondegenerate quadric in that space. Of course, non-degenerate quadrics themselves are examples of quasi-quadrics, but many other examples exist. In the case that n is odd, quasi-quadrics have two sizes of intersections with hyperplanes and so are two-charact...
متن کاملCompetitive Local Routing with Constraints
Let P be a set of n points in the plane and S a set of non-crossing line segments between vertices in P , called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained θm-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture θ = 2π/m, and adding an edge ...
متن کاملOn the distance based indices of H-phenylenic nanotorus
Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...
متن کاملJim Stewart 1 Shortest Path Problems
The topic of this lecture is the application of triangulations to shortest path problems. Only simple polygons will be considered. Given two points inside a polygon, the goal is to find the shortest path lying inside the polygon between the two points; see Fig. 1. One can think of the shortest path as a taut string connecting the two points. We begin with some definitions. Let P be a simple pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014